Graded Tolerant Inclusion and its Axiomatization
نویسندگان
چکیده
This paper is devoted to an extension of the inclusion operator. The main idea that we suggest is to relax the arguments of the inclusion by means of proximity-based modifiers in order to obtain a more tolerant inclusion. It is shown that the relaxation can be envisaged in order to design a tolerant inclusion whose result is either Boolean, or valued in the unit interval. The focus is particularly made on graded tolerant inclusion. A set of axioms that was previously proposed for the characterization of graded inclusion of fuzzy sets is revisited in order to take into account the specificities of tolerant inclusion.
منابع مشابه
On the use of tolerant graded inclusions in information retrieval
In this contribution, a fuzzy-set-based information retrieval model is considered. First, we show that the retrieval mechanism of such a retrieval model can be defined in terms of graded inclusion. This approach derives from the notion of division of fuzzy relations in the framework of Database Management Systems. Then, we point out different lines of extension of the graded inclusion aimed at ...
متن کاملAxiomatization of General Concept Inclusions from Streams of Interpretations with Optional Error Tolerance
We propose applications that utilize the infimum and the supremum of closure operators that are induced by structures occuring in the field of Description Logics. More specifically, we consider the closure operators induced by interpretations as well as closure operators induced by TBoxes, and show how we can learn GCIs from streams of interpretations, and how an error-tolerant axiomatization o...
متن کاملA Finite Axiomatization of Conditional Independence and Inclusion Dependencies
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.
متن کاملAxiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
متن کاملA Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checking are formulated in terms of modal logic and an algorithm for their solution is provided. An axiomatization for a restricted graded modal language with intersection of modalities (the modal counterpart of the concept ...
متن کامل